<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    423. Reconstruct Original Digits from English
   </h1>
   <p>
    Given a
    <b>
     non-empty
    </b>
    string containing an out-of-order English representation of digits
    <code>
     0-9
    </code>
    , output the digits in ascending order.
   </p>
   <p>
    <b>
     Note:
    </b>
    <br>
   </p>
   <ol>
    <li>
     Input contains only lowercase English letters.
    </li>
    <li>
     Input is guaranteed to be valid and can be transformed to its original digits. That means invalid inputs such as "abc" or "zerone" are not permitted.
    </li>
    <li>
     Input length is less than 50,000.
    </li>
   </ol>
   <p>
    <b>
     Example 1:
    </b>
    <br>
   </p>
   <pre>
Input: "owoztneoer"

Output: "012"
</pre>
   <p>
    <b>
     Example 2:
    </b>
    <br>
   </p>
   <pre>
Input: "fviefuro"

Output: "45"
</pre>
  </div>
  <div>
   <h1 class="question_title">
    423. 从英文中重建数字
   </h1>
   <p>
    给定一个
    <strong>
     非空
    </strong>
    字符串，其中包含字母顺序打乱的英文单词表示的数字
    <code>
     0-9
    </code>
    。按升序输出原始的数字。
   </p>
   <p>
    <strong>
     注意:
    </strong>
   </p>
   <ol>
    <li>
     输入只包含小写英文字母。
    </li>
    <li>
     输入保证合法并可以转换为原始的数字，这意味着像 "abc" 或 "zerone" 的输入是不允许的。
    </li>
    <li>
     输入字符串的长度小于 50,000。
    </li>
   </ol>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre>
输入: "owoztneoer"

输出: "012" (zeroonetwo)
</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre>
输入: "fviefuro"

输出: "45" (fourfive)
</pre>
  </div>
 </body>
</html>